On the Speed of Convergence of Iteration of a Function
نویسنده
چکیده
Let fn(X) be the nth iterate of a function in some interval [0, c]. It is known that if f(x) xxc, a > 1, then fn(X) An for some A and a. In this paper we prove a converse of this theorem: The rate of convergence of the iterates determines the form of a function.
منابع مشابه
Modified frame algorithm and its convergence acceleration by Chebyshev method
The aim of this paper is to improve the convergence rate of frame algorithm based on Richardson iteration and Chebyshev methods. Based on Richardson iteration method, we first square the existing convergence rate of frame algorithm which in turn the number of iterations would be bisected and increased speed of convergence is achieved. Afterward, by using Chebyshev polynomials, we improve this s...
متن کاملOn The Convergence Of Modified Noor Iteration For Nearly Lipschitzian Maps In Real Banach Spaces
In this paper, we obtained the convergence of modified Noor iterative scheme for nearly Lipschitzian maps in real Banach spaces. Our results contribute to the literature in this area of re- search.
متن کاملOn the convergence speed of artificial neural networks in the solving of linear systems
Artificial neural networks have the advantages such as learning, adaptation, fault-tolerance, parallelism and generalization. This paper is a scrutiny on the application of diverse learning methods in speed of convergence in neural networks. For this aim, first we introduce a perceptron method based on artificial neural networks which has been applied for solving a non-singula...
متن کاملConvergence of the multistage variational iteration method for solving a general system of ordinary differential equations
In this paper, the multistage variational iteration method is implemented to solve a general form of the system of first-order differential equations. The convergence of the proposed method is given. To illustrate the proposed method, it is applied to a model for HIV infection of CD4+ T cells and the numerical results are compared with those of a recently proposed method.
متن کاملTwo Novel Learning Algorithms for CMAC Neural Network Based on Changeable Learning Rate
Cerebellar Model Articulation Controller Neural Network is a computational model of cerebellum which acts as a lookup table. The advantages of CMAC are fast learning convergence, and capability of mapping nonlinear functions due to its local generalization of weight updating, single structure and easy processing. In the training phase, the disadvantage of some CMAC models is unstable phenomenon...
متن کاملA new optimal method of fourth-order convergence for solving nonlinear equations
In this paper, we present a fourth order method for computing simple roots of nonlinear equations by using suitable Taylor and weight function approximation. The method is based on Weerakoon-Fernando method [S. Weerakoon, G.I. Fernando, A variant of Newton's method with third-order convergence, Appl. Math. Lett. 17 (2000) 87-93]. The method is optimal, as it needs three evaluations per iterate,...
متن کامل